/**
 * @Author ZhangCuirong
 * @Date 2025/8/12 11:15
 * @description:
 */
public class Solution704 {
    public int search(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (nums[mid] < target) {
                left = mid + 1;
            } else if (nums[mid] > target) {
                right = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        Solution704 solution = new Solution704();
        int[] nums = new int[]{-1, 0, 3, 5, 9, 12};
        int target = 9;
        int res = solution.search(nums, target);
        System.out.println(res);
    }

}
